Inhomogeneous approximation with coprime integers and lattice orbits
نویسندگان
چکیده
Let (ξ, y) be a point in R and ψ : N→ R a function. We investigate the problem of the existence of infinitely many pairs p, q of coprime integers such that |qξ + p− y| ≤ ψ(|q|). We give both unconditional results which are valid for every real pair (ξ, y) with ξ irrational, and metrical results valid for almost all points (ξ, y). We link the subject with density exponents of lattice orbits in R.
منابع مشابه
Inhomogeneous approximation by coprime integers
This paper addresses a problem recently raised by Laurent and Nogueira about inhomogeneous Diophantine approximation with coprime integers. A corollary of our main theorem is that for any irrational α ∈ R and for any γ ∈ R and > 0 there are infinitely many pairs of coprime integers m,n such that |nα−m− γ| ≤ 1/|n| . This improves upon previously known results, in which the exponent of approximat...
متن کاملOn a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملApproximate Polynomial GCD over Integers with Digits-wise Lattice
For the given coprime polynomials over integers, we change their coefficients slightly over integers so that they have a greatest common divisor (GCD) over integers. That is an approximate polynomial GCD over integers. There are only two algorithms known for this problem. One is based on an algorithm for approximate integer GCDs. The other is based on the well-known subresultant mapping and the...
متن کاملOn the Least Prime in Certain Arithmetic Progressions
We nd innnitely many pairs of coprime integers, a and q, such that the least prime a (mod q) is unusually large. In so doing we also consider the question of approximating rationals by other rationals with smaller and coprime denominators.
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016